The Optimal Drawings of $K_{5, n}$

نویسندگان

  • César Hernández-Vélez
  • R. Carolina Medina Ramírez
  • Gelasio Salazar
چکیده

Zarankiewicz’s Conjecture (ZC) states that the crossing number cr(Km,n) equals Z(m,n) := bm2 cb m−1 2 cb n 2 cb n−1 2 c. Since Kleitman’s verification of ZC for K5,n (from which ZC for K6,n easily follows), very little progress has been made around ZC; the most notable exceptions involve computer-aided results. With the aim of gaining a more profound understanding of this notoriously difficult conjecture, we investigate the optimal (that is, crossing-minimal) drawings of K5,n. The widely known natural drawings of Km,n (the so-called Zarankiewicz drawings) with Z(m,n) crossings contain antipodal vertices, that is, pairs of degree-m vertices such that their induced drawing of Km,2 has no crossings. Antipodal vertices also play a major role in Kleitman’s inductive proof that cr(K5,n) = Z(5, n). We explore in depth the role of antipodal vertices in optimal drawings of K5,n, for n even. We prove that if n ≡ 2 (mod 4), then every optimal drawing of K5,n has antipodal vertices. We also exhibit a two-parameter family of optimal drawings Dr,s of K5,4(r+s) (for r, s > 0), with no antipodal vertices, and show that if n ≡ 0 (mod 4), then every optimal drawing of K5,n without antipodal vertices is (vertex rotation) isomorphic to Dr,s for some integers r, s. As a corollary, we show that if n is even, then every optimal drawing of K5,n is the superimposition of Zarankiewicz drawings with a drawing isomorphic to Dr,s for some nonnegative integers r, s.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The crossing numbers of $K_{n,n}-nK_2$, $K_{n}\times P_2$, $K_{n}\times P_3$ and $K_n\times C_4$

The crossing number of a graph G is the minimum number of pairwise intersections of edges among all drawings of G. In this paper, we study the crossing number of Kn,n − nK2, Kn × P2, Kn × P3 and Kn × C4.

متن کامل

MOST RESULTS ON A-IDEALS IN MV -MODULES

In the present paper, by considering the notion of MV-modules which is the structure that naturally correspond to lu-modules over lu-rings, we prove some results on prime A-ideals and state some conditions to obtain a prime A-ideal in MV-modules. Also, we state some conditions that an A-ideal is not prime and investigate conditions that $Ksubseteq bigcup _{i=1}^{n}K_{i}$ implies $Ksubseteq K_{j...

متن کامل

Total domination in $K_r$-covered graphs

The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...

متن کامل

A K-Theoritic Approach to Some C*-Algebras

In this paper we look at the K-theory of a specific C*-algebra closely related to the irrational rotation algebra. Also it is shown that any automorphism of a C*-algebra A induces group automorphisms of K_{1}(A) amd K_{0}(A) in an obvious way. An interesting problem for any C*-algebra A is to find out whether, given an automorphism of K_{0}(A) and an automorphism of K_{1}(A), we can lift them t...

متن کامل

On the Volume of µ-way G-trade

A  $ mu $-way  $ G $-trade ($ mu geq 2) $  consists of $ mu $ disjoint decompositions of some simple (underlying) graph $ H $ into copies of a graph $ G. $  The   number of copies of the  graph $ G $ in  each of the decompositions is the volume of the $ G $-trade and   denoted by $ s. $ In this paper, we determine all values  $ s $ for which there exists a $  mu $-way   $ K_{1,m} $-trade of  vo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014